Tables should be sorted (on random access machines)

Tables Should Be Sorted (On Random Access Machines)

We consider the problem of storing an n element subset S of a universe of size m, so that membership queries (is x ∈ S?) can be answered efficiently. The model of computation is a random access machine with the standard instruction set (direct and indirect adressing, conditional branching, addition, subtraction, and multiplication). We show that if s memory registers are used to store S, where ...

Neural Random-Access Machines

In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...

Relative Cost Random Access Machines

Fast Simulation of Turing Machines by Random Access Machines

I-14: Assisted Reproduction and Religion What Consideration Should Be and Should Not Be Relevant,

Several important issues are pertinent to an ethical discussion of the new technology today grouped under the name Assisted Reproduction Technology (ART). This is a moral imperative because each of us must decide what is to be considered ethically acceptable in assisted reproduction. Reflecting on the ethical dimension of ‘creating’ a new human life can play a major role in ensuring that in eac...